A computational model of a class of gene networks with positive and negative controls.

This article proposes a computational framework for modelling the logical behavior of a class of gene networks. We characterize the basic behavior of genes in terms of a state-and-transition structure, and model the individual genes as language-generating automata. We consider positive and negative controls as the interaction mechanisms among the genes, and treat such controls as constraints (also expressed in automata) imposed on the behavior of the gene network. By computing the intersection of the languages generated by the gene models and the constraints, we obtain the complete set of pathways in a gene network. Implications and possible improvement of this work are discussed.